Cell probe complexity - a survey
نویسنده
چکیده
The cell probe model is a general, combinatorial model of data structures. We give a survey of known results about the cell probe complexity of static and dynamic data structure problems, with an emphasis on techniques for proving lower bounds.
منابع مشابه
A Survey of Communication Complexity for Proving Lower Bound of Data Structures in Cell-Probe Model
Proving lower bounds for computational problem is always a challenging work. In this survey, we will present some techniques for proving lower bound of data structures in cellprobe model. There is a natural relationship between cell-probe model and communication complexity, so many proofs of lower bound in cell-probe model are related to communication complexity. In communication complexity, th...
متن کاملLower Bounds for Dynamic Connectivity (2004; Pǎtraşcu, Demaine)
To specify the problem completely, we will say elements A[i] come from an arbitrary group G, containing at least 2δ elements. In the cell-probe model with b-bit cells, let tΣu be the complexity of update, and tΣq be the complexity of testsum (which is also a lower bound on sum). The trade-offs between tΣu and t Σ q are well understood for all values of b and δ. However, in this survey we only l...
متن کاملCell-Probe Proofs and Nondeterministic Cell-Probe Complexity
We study the nondeterministic cell-probe complexity of static data structures. We introduce cell-probe proofs (CPP), a proof system for the cell-probe model, which describes verifications instead of computations in the cell-probe model. We present a combinatorial characterization of CPP. With this novel tool, we prove the following lower bounds for the nondeterministic cell-probe complexity of ...
متن کاملOn Dynamic Bit-Probe Complexity
This work present several advances in the understanding of dynamic data structures in the bit-probe model: • We improve the lower bound record for dynamic language membership problems to Ω(( lg n lg lg n ) ). Surpassing Ω(lg n) was listed as the first open problem in a survey by Miltersen. • We prove a bound of Ω( lg n lg lg lg n ) for maintaining partial sums in Z/2Z. Previously, the known bou...
متن کاملCommunication Complexity
The disjointness problem is one of the most important questions in communication complexity, and lower bounds for disjointness have been used to derive lower bounds for streaming algorithms, data structures, barriers in complexity (algebraization), approaches for circuit lower bounds, proof complexity, game theory. Some sources on this include the survey “The Story of Set Disjointness” by Chatt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999